Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Algebraic and Boolean Methods for SFQ Superconducting Circuits
 
conference paper not in proceedings

Algebraic and Boolean Methods for SFQ Superconducting Circuits

Tempia Calvino, Alessandro  
•
De Micheli, Giovanni  
January 22, 2024
29th Asia and South Pacific Design Automation Conference

Rapid single-flux quantum (RSFQ) is one of the most advanced and promising superconducting logic families, offering exceptional energy efficiency and speed. RSFQ technology requires delay registers (DFFs) and splitter cells to satisfy the path-balancing and driving-capacity constraints. In this paper, we present a comprehensive exploration of methods for synthesizing and optimizing SFQ circuits. Our approach includes algebraic and Boolean optimization techniques that work on the xor-and graph (XAG) representation of combinational logic. Additionally, we introduce a technology mapping method to satisfy the path-balancing and fanout constraints while minimizing the area. Finally, we propose a synthesis flow for SFQ circuits. In the experimental results, we show an average reduction in the area and delay of 43% and 34%, respectively, compared to the state-of-the-art.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

2023285889.pdf

Type

Preprint

Version

Submitted version (Preprint)

Access type

openaccess

License Condition

n/a

Size

211.53 KB

Format

Adobe PDF

Checksum (MD5)

d7754667fe4616fd21e573f82eed8052

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés